A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph
نویسندگان
چکیده
In this paper we propose a new self-stabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is general in the sense that it can stabilize with every possible minimal dominating set of the graph.
منابع مشابه
A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap
In a graph , a set is said to be total dominating if every is adjacent to some member of . When the graph represents a communication network, a total dominating set corresponds to a collection of servers having a certain desirable backup property, namely, that every server is adjacent to some other server. Selfstabilization, introduced by Dijkstra [1, 2], is the most inclusive approach to fault...
متن کاملSelf-Stabilizing Graph Protocols
We provide self-stabilizing algorithms to obtain and maintain a maximal matching, maximal independent set or minimal dominating set in a given system graph. They converge in linear rounds under a distributed or synchronous daemon. They can be implemented in an ad hoc network by piggy-backing on the beacon messages that nodes already use.
متن کاملSelf-Stabilizing Algorithms for {k}-Domination
In the self-stabilizing algorithmic paradigm for distributed computing each node has only a local view of the system, yet in a nite amount of time the system converges to a global state, satisfying some desired property. A function f : V (G) ! f0; 1; 2; : : : ; kg is a fkgdominating function if j2N[i]f(j) k for all i 2 V (G). In this paper we present self-stabilizing algorithms for nding a mini...
متن کاملA Uniform Self-Stabilizing Minimum Diameter Spanning Tree Algorithm
We present a uniform self-stabilizing algorithm, which solves the problem of distributively nding a minimum diameter spanning tree of an arbitrary positively real-weighted graph. Our algorithm consists in two stages of stabilizing protocols. The rst stage is a uniform randomized stabilizing unique naming protocol, and the second stage is a stabilizing MDST protocol, designed as a fair compositi...
متن کاملSelf-stabilizing Rendezvous of Synchronous Mobile Agents in Graphs
We investigate self-stabilizing rendezvous algorithms for two synchronous mobile agents. The rendezvous algorithms make two mobile agents meet at a single node, starting from arbitrary initial locations and arbitrary initial states. We study deterministic algorithms for two synchronous mobile agents with different labels but without using any whiteboard in the graph. First, we show the existenc...
متن کامل